Quickest Change Detection of a Markov Process Across a Sensor Array
نویسندگان
چکیده
منابع مشابه
Quickest Change Point Detection and Identification Across a Generic Sensor Array
In this paper, we consider the problem of quickest change point detection and identification over a linear array of N sensors, where the change pattern could first reach any of these sensors, and then propagate to the other sensors. Our goal is not only to detect the presence of such a change as quickly as possible, but also to identify which sensor that the change pattern first reaches. We joi...
متن کاملQuickest Change Detection in Hidden Markov Models for Sensor Networks
The decentralized quickest change detection problem is studied in sensor networks, where a set of sensors receive observations from a hidden Markov model (HMM) X and send sensor messages to a central processor, called the fusion center, which makes a final decision when observations are stopped. It is assumed that the parameter θ in the hidden Markov model for X changes from θ0 to θ1 at some un...
متن کاملDecentralized quickest change detection
A decentralized formulation of the quickest change detection problem is studied, where the distributions of the observations at all of the sensors in the system change at the time of disruption, and the sensors communicate with a common fusion center. A Bayesian setting is considered in which a priori knowledge of the change time distribution is available. The observations are assumed to be ind...
متن کاملQuickest Change Detection
The problem of detecting changes in the statistical properties of a stochastic system and time series arises in various branches of science and engineering. It has a wide spectrum of important applications ranging from machine monitoring to biomedical signal processing. In all of these applications the observations being monitored undergo a change in distribution in response to a change or anom...
متن کاملQuickest Detection of a Random Signal in Background Noise Using a Sensor Array
The problem of detecting the onset of a signal impinging at an unknown angle on a sensor array is considered. An algorithm based on parallel CUSUM tests matched to each of a set of discrete beamforming angles is proposed. Analytical approximations are developed for the mean time between false alarms, and for the detection delay of this algorithm. Simulations are included to verify the results o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2010
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2010.2040869